2 . 3 Orpg Review : Clustering , Database and System Management

نویسندگان

  • Zhongqi Jing
  • Steve Smith
  • Michael Jain
چکیده

Clustering is a widely used architecture to implement scalable, highly-available systems. The ORPG clustering technology is based on a loosely-coupled multi-tasking software architecture. It allows the ORPG system to run on multiple nodes (UNIX hosts, e.g. workstations and PCs) and thus, makes ORPG scalable. When the processing resource requirement increases beyond the current RPG hardware limitation, new hardware such as PCs can be incrementally added to the system to scale up the processing capability.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Health System Financial Supply Chain Management with System Dynamics Approach: An Integrated Review

Introduction: Financing, creating resources, delivering services, and stewardship are the four main tasks of the health system, and achieving these goals is the main indicator of an efficient and fair health system. The present study was conducted to investigate the model of the management of the financing chain of the health system with the approach of system dynamics. Methods: In this integra...

متن کامل

Review on Fragment Allocation by using Clustering Technique in Distributed Database System

Considerable Progress has been made in the last few years in improving the performance of the distributed database systems. The development of Fragment allocation models in Distributed database is becoming difficult due to the complexity of huge number of sites and their communication considerations. Under such conditions, simulation of clustering and data allocation is adequate tools for under...

متن کامل

A Systematic Review of Banking Business Models with an Approach to Sustainable Development

Modern banks have shifted their function as purely administrative, economic and industrial entities into socio-political institutions that must be sensitive to the surrounding environment. This function has always been neglected. This study was conducted based on primary, secondary, and tertiary data and reviews the full text of 75 studies selected from more than 245 studies. The selected elect...

متن کامل

Computing the obstacle number of a plane graph

An obstacle representation of a plane graphG is V (G) together with a set of opaque polygonal obstacles such that G is the visibility graph on V (G) determined by the obstacles. We investigate the problem of computing an obstacle representation of a plane graph (ORPG) with a minimum number of obstacles. We call this minimum size the obstacle number of G. First, we show that ORPG is NP-hard by r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002